A 1.75-Approximation Algorithm for Unsigned Translocation Distance
نویسندگان
چکیده
The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [J. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, in: 6th ACM–SIAM Symposium on Discrete Algorithms, 1995, pp. 604–613]. © 2007 Elsevier Inc. All rights reserved.
منابع مشابه
A ð1:5þ Þ-Approximation Algorithm for Unsigned Translocation Distance
Genome rearrangement is an important area in computational biology and bioinformatics. The translocation operation is one of the popular operations for genome rearrangement. It was proved that computing the unsigned translocation distance is NP-hard. In this paper, we present a ð1:5þ Þ-approximation algorithm for computing the unsigned translocation distance that improves upon the best known 1....
متن کاملOn the complexity of unsigned translocation distance
Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard...
متن کاملAlgorithms for sorting unsigned linear genomes by the DCJ operations
MOTIVATION The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both linear and circular (uni- and multi-) chromosomes is well studied, the only known result for the NP-complete unsigned DCJ distance problem is an approximation algorithm for unsigned linear unichromosomal genomes. In thi...
متن کاملApproximation Algorithm for Sorting by Reversals and Transpositions
Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a (4 − 2 k )-approximat...
متن کاملEstimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-hard. The best guaranteed error bounded is the 3/2approximation algorithm. However, the problem of sorting signed permutation can be solved easily. Fast algorithms have been developed both for finding the sorting sequen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 73 شماره
صفحات -
تاریخ انتشار 2005